Papers with prompt tuning
Copied to clipboard
| Challenge: | Existing methods for prompt tuning and input pre-processing are under-studied . e.g., ReLLM replaces low-frequency words with their high-frequency counterparts . |
| Approach: | They propose a method that automatically paraphrases input content for better output generation. |
| Outcome: | The proposed method is user-friendly and requires no additional training. |
Copied to clipboard
| Challenge: | Existing works on implicit discourse relation recognition focus on syntax features and lack of connectives. |
| Approach: | They propose a prompt-based path prediction method that integrates the interactive information and intrinsic senses among the hierarchy in IDRR. |
| Outcome: | The proposed method shows significant improvement against competitive baselines. |
Copied to clipboard
| Challenge: | Existing work does not take full advantage of over-parameterized characteristics of large pre-trained language models. |
| Approach: | They propose a method that uses frozen "thinned" networks to obtain a mixture of rewards and advance the derivative-free prompt learning. |
| Outcome: | The proposed method outperforms previous gradient-free prompt learning methods and achieves parity with gradient-based counterparts on seven language understanding benchmarks under few-shot settings. |
Copied to clipboard
| Challenge: | Existing methods of prompt tuning cannot handle hard sequence labeling tasks. |
| Approach: | They propose to optimize prompt tuning to tune continuous prompts with a frozen language model. |
| Outcome: | The proposed method matches finetuning with prompt tuning while having only 0.1%-3% tuned parameters. |
Copied to clipboard
| Challenge: | a growing number of parameter-efficient adaptation methods are needed to fine-tune large language models. |
| Approach: | They propose a method that combines prompt tuning and in-context learning to improve prompt tuning by concatenating a natural language demonstration with learned prompt embeddings. |
| Outcome: | The proposed method outperforms prompt tuning and prompt tuning on five language generation tasks. |
Copied to clipboard
| Challenge: | Xu et al., 2019) show that pre-trained language model fine-tuning and prompt tuning are better than manual prompt engineering for clarification identification. |
| Approach: | They propose to use pre-trained language model fine-tuning, prompt tuning and manual prompt engineering to model clarification identification. |
| Outcome: | The proposed model outperforms pre-trained language model fine-tuning, prompt tuning and manual prompt engineering on the task of clarification identification. |
Copied to clipboard
| Challenge: | Socratic questioning is a form of reflective inquiry often employed in education to encourage critical thinking in students. |
| Approach: | They present a first large dataset of 110K questions, context pairs for Socratic Question Generation. |
| Outcome: | The proposed model produces realistic, type-sensitive, human-like Socratic questions . authors show that the model can be used in counseling and coaching . |
Copied to clipboard
| Challenge: | Prompt-based methods lack crucial linguistic knowledge for readability assessment tasks such as word length, sentence length, and usage of different difficulty-level words. |
| Approach: | They propose a new prompt-based tuning framework that incorporates linguistic knowledge and a loss function to calibrate the similarity ranking order between categories. |
| Outcome: | The proposed framework outperforms the large language model gpt-3.5-turbo-16k in most cases. |
Copied to clipboard
| Challenge: | Prompt tuning is an effective method for adapting pre-trained language models to downstream tasks. |
| Approach: | They propose to use prompt tuning for semantic parsing to map natural language utterances onto formal meaning representations. |
| Outcome: | The proposed method outperforms the fine-tuned model on low-resource splits of Overnight and TOPv2 on language representations with increasing model scale and target representations. |
Copied to clipboard
| Challenge: | Recent advances have shown that Pre-trained Language Models (PLMs) can achieve promising performance in many downstream Natural Language Processing (NLP) tasks. |
| Approach: | They propose to incorporate prior knowledge about contradictory intentions into prompt tuning for sarcasm recognition by mimicking the actual intention by verbalizer engineering. |
| Outcome: | The proposed model mimics the actual intention by prompt construction and indicates whether the actual intent contradicts the literal content by verbalizer engineering. |
Copied to clipboard
| Challenge: | Prompt tuning has demonstrated success in natural language pretraining and even vision pretraining. |
| Approach: | They propose to apply prompt tuning to a unified sequence-to-sequence pretrained model by adding a sequence of learnable embeddings to each layer and finetuning the pretrained models on downstream tasks. |
| Outcome: | The proposed method outperforms other parameter-efficient tuning methods on multimodal models and is robust against adversarial attacks. |
Copied to clipboard
| Challenge: | Prompt tuning is an efficient method for initializing pre-trained models . but initialization of prompts is sensitive when the model size is small . |
| Approach: | They propose a method to measure catastrophic forgetting by analyzing prompts for the first time . they characterize a question answering task based on answer format and prompt initialization . |
| Outcome: | The proposed approach can help deepen understanding of prompt tuning. |
Copied to clipboard
| Challenge: | Prompt tuning on a few data samples presents security issues, e.g., Trojan attacks. |
| Approach: | They propose a method to transfer established data poisoning attacks directly to few-shot prompt tuning, a technique to address the poisoned imbalance issue. |
| Outcome: | The proposed method achieves an ASR of over 99% while maintaining negligible decreases in CDA. |
Copied to clipboard
| Challenge: | High-quality information extractions often require domain-specific accuracy, up-to-date understanding of specialized taxonomies, and the ability to incorporate emerging jargon and rare outliers. |
| Approach: | They propose a Dynamic Self-Evolving Extraction and Curation Toolkit which continuously improves as it is used to extract structured information from raw text. |
| Outcome: | The proposed toolkit continuously improves as it is used in medical, legal, and HR domains. |
Copied to clipboard
| Challenge: | Existing methods for prompt tuning can overfit to few-shot training samples, causing overfitting . authors propose a new framework for prompt learning with supervised meta-learning . |
| Approach: | They propose a self-supervised meta-prompt learning framework with MEta-gradient Regularization for few-shot generalization that leverages self-recognized meta-learning with a diverse set of meta-tasks to learn a universal prompt initialization using only unlabeled data. |
| Outcome: | The proposed framework learns a universal prompt initialization for efficient adaptation using only unlabeled data. |
Copied to clipboard
| Challenge: | Prompt tuning is an efficient method for adapting large language models, but it is difficult and expensive to identify the source task that provides optimal prompts. |
| Approach: | They propose to learn a shared latent space which captures a set of basis skills from a mixture of source tasks and then transfer them to target tasks. |
| Outcome: | The proposed method outperforms previous methods on NLI, sentence completion, QA, conference resolution, word sense disambiguation and on various model scales. |
Copied to clipboard
| Challenge: | Existing methods to detect AI-generated text are inadequate, causing misuse of the text. |
| Approach: | They propose a universal evasive prompt framework that can prompt any PLM to generate “human-like” text that can mislead detectors. |
| Outcome: | The proposed approach can prompt any PLM to generate “human-like” text that can mislead detectors. |
Copied to clipboard
| Challenge: | Prompt tuning is parameter-efficient but lags behind other state-of-the-art methods. |
| Approach: | They propose a parameter-efficient tuning method that only optimizes a soft prompt to adapt PTMs to downstream tasks. |
| Outcome: | The proposed method is parameter-efficient but lags behind other state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing prompt transfer techniques lack consideration for dialogue-specific information. |
| Approach: | They propose a method which leverages skeleton generation as extra supervision that functions as a medium connecting the distinct source and target task. |
| Outcome: | The proposed method significantly outperforms baselines on two dialogue summarization benchmarks. |
Copied to clipboard
| Challenge: | Existing prompt tuning methods for cross-domain sentiment analysis have been underutilized due to domain discrepancy in the token distributions. |
| Approach: | They propose a new method to model cross-domain sentiment analysis using pre-trained language models by using soft prompts instead of hard templates. |
| Outcome: | The proposed method achieves state-of-the-art results on a publicly available sentiment analysis dataset. |
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) have impressive capabilities in open-ended text generation. |
| Approach: | They propose a dynamic knowledge-guided informative open-ended text generation approach that utilizes a knowledge graph to help the model generate more contextually related entities and detailed facts. |
| Outcome: | The proposed approach generates more informative texts than baselines. |
Copied to clipboard
| Challenge: | Unlike discrete text prompts used by GPT-3, soft prompts are learned through backpropagation and can be tuned to incorporate signals from any number of labeled examples. |
| Approach: | They propose a mechanism for learning "soft prompts" to condition frozen language models to perform specific downstream tasks. |
| Outcome: | The proposed method outperforms fewshot learning using GPT-3 and matches the quality of model tuning as models exceed billions of parameters. |
Copied to clipboard
| Challenge: | Prompt tuning is a technique for adapting large-scale pretrained language models for downstream tasks. |
| Approach: | They propose to condition a frozen pretrained language model with soft prompts from data . they propose to use a domain adaptation technique to regularize the decision boundary . |
| Outcome: | The proposed method outperforms full-model tuning in data-scarce settings by a large margin. |
Copied to clipboard
| Challenge: | Recent studies have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing tasks. |
| Approach: | They propose a prompt tuning framework that reformulates NLP tasks into a discriminative language modeling problem. |
| Outcome: | The proposed framework improves on text classification and question answering tasks and prevents unstable tuning problems in low-resource settings. |
Copied to clipboard
| Challenge: | Pre-trained language models capture factual knowledge from massive texts . but they are still quite behind the SOTA KGC models in terms of performance . |
| Approach: | They propose to use open-world assumption to evaluate PLM-based knowledge graph completion models . they propose to convert each triple and its support information into natural prompt sentences . |
| Outcome: | The proposed model is more accurate under the open-world assumption (OWA) this setting manual checks the correctness of knowledge that is not in KGs. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are used in natural language processing tasks with an unrealistic speed and effectiveness. |
| Approach: | They propose more compact ways of providing dialog history information while ensuring good performance and reducing model’s inference-API costs. |
| Outcome: | The proposed models have the optimal usable-information density while maintaining good performance and reducing model’s inference-API costs. |
Copied to clipboard
| Challenge: | Recent language model prompting methods can achieve high accuracy in zero- and few-shot settings while requiring few to no learned task-specific parameters. |
| Approach: | They propose to use a dedicated pretraining stage to improve promptability in zero-shot settings and few-shot tuning. |
| Outcome: | The proposed method improves promptability in zero- and few-shot settings, while the existing method yields subpar performance. |
Copied to clipboard
| Challenge: | Recent advances in "Chain of Models" approach increase resource demands as each model must be deployed separately. |
| Approach: | They propose a prompt-tuning method that enables models to share hidden states . they modify input and attention masks during training to eliminate redundant forward passes . |
| Outcome: | Empirical results show that FTHSS matches the performance of traditional model chains while improving inference efficiency. |
Copied to clipboard
| Challenge: | Existing methods of fine-tuning vision-language navigation models require extra human-labeled data and lack self-exploration capabilities in environments. |
| Approach: | They propose a method that can self-explore environments without human labeling . they use a large-scale cross-modal pretrained model to build an in-domain dataset . |
| Outcome: | The proposed model can self-explore environments without human labeling without human supervision and generates structured instructions without human intervention. |
Copied to clipboard
| Challenge: | Multi-level implicit discourse relation recognition (MIDRR) aims at identifying hierarchical discourse relations among arguments. |
| Approach: | They propose a prompt-based multi-level implicit discourse relation recognition framework that leverages parameter-efficient prompt tuning to drive inputted arguments to match the pre-trained space. |
| Outcome: | The proposed framework achieves comparable results on PDTB 2.0 and 3.0 using about 0.1% trainable parameters compared with baselines. |
Copied to clipboard
| Challenge: | Prior work has suggested methods for finding better prompt or scoring of the output from the model. |
| Approach: | They propose a noisy channel approach for language model prompting in few-shot text classification by in-context demonstration or prompt tuning. |
| Outcome: | The proposed model outperforms direct models in both demonstration and prompt tuning. |
Copied to clipboard
| Challenge: | Spotlighter is a lightweight token-selection framework that enhances accuracy and efficiency in prompt tuning. |
| Approach: | They propose a token-selection framework that enhances accuracy and efficiency in prompt tuning by preserving only the top-scoring tokens for downstream prediction. |
| Outcome: | The proposed framework outperforms CLIP by up to 11.19% in harmonic mean accuracy and achieves 0.8K additional FPS, with only 21 extra parameters. |
Copied to clipboard
| Challenge: | Pre-trained multilingual language models show significant performance gains for zero-shot cross-lingual model transfer on a wide range of natural language understanding (NLU) tasks. |
| Approach: | They do cross-lingual evaluation using prompt tuning and compare it with fine-tuning . prompt tuning achieves much better cross-linguistic transfer than fine- tuning . |
| Outcome: | The results show that prompt tuning achieves better cross-lingual transfer than fine-tuning across datasets, with only 0.1% to 0.3% tuned parameters. |
Copied to clipboard
| Challenge: | Prompt tuning is one of the most parameter-efficient approaches for parameter-effective tuning of pre-trained language models. |
| Approach: | They propose to reparameterize soft prompt embeddings using a shallow network with a residual connection and use it to tune prompt embeds P. |
| Outcome: | The proposed method outperforms prompt tuning on SuperGLUE, T5-Base and BERT-Bass models and can reduce the prompt length by 10 times without hurting performance. |
Copied to clipboard
| Challenge: | a new multi-task, parameter-efficient language model tuning method learns to transfer knowledge across different tasks via a mixture of soft prompts. |
| Approach: | They propose a multi-task, parameter-efficient language model tuning method that uses soft prompts to learn to transfer knowledge across different tasks. |
| Outcome: | The proposed method outperforms prompt tuning and outperfies or matches fully fine-tuned tuning approaches that use 10 times more parameters. |
Copied to clipboard
| Challenge: | Prompt tuning is an important technique for directing model behaviors and eliciting desired responses. |
| Approach: | They propose to find optimal prompt tokens using soft Q-learning to optimize models for prompt tuning. |
| Outcome: | The proposed method improves on baseline prompt tuning, and the results are more natural and interpretable. |
Copied to clipboard
| Challenge: | Recent work shows that language models trained with multi-task instructional learning (MTIL) can solve diverse NLP tasks in zero-shot settings with improved performance compared to prompt tuning. |
| Approach: | They propose to adapt meta-learning to MTIL in three directions: 1) Model Agnostic Meta Learning (MAML), 2) Hyper-Network adaptation to generate task specific parameters conditioned on instructions. |
| Outcome: | The proposed approaches improve over strong baselines in zero-shot settings and are most impactful when the test tasks are strictly zero- shot and are "hard" |
Copied to clipboard
| Challenge: | Using a prompt-based model, we find that event argument extraction is efficient and generalized well to few-shot settings. |
| Approach: | They propose a model PAIE for event argument extraction using prompt tuning for extractive objectives. |
| Outcome: | The proposed model can extract arguments with the same role instead of heuristic threshold tuning. |
Copied to clipboard
| Challenge: | Prompt tuning is effective in extracting knowledge from foundation models, but its effectiveness is uncertain. |
| Approach: | They propose a parametric prompt tuning strategy that dynamically determines different factors of prompts based on specific tasks or instances. |
| Outcome: | The proposed approach improves performance across a wide range of tasks including NLP, vision recognition, and vision-language tasks. |
Copied to clipboard
| Challenge: | Prompt tuning of Large Language Models (LLMs) can incur performance degradation or low training efficiency. |
| Approach: | They propose a prompt tuning approach with Adaptive Optimization to enable efficient FL of LLMs. |
| Outcome: | The proposed approach improves performance and efficiency simultaneously and addresses client drift problems on both the device and server sides. |
Copied to clipboard
| Challenge: | Current retrieval models focus on natural text-image retrieval, which is insufficient for STEM education contexts due to ambiguities in the retrieval process. |
| Approach: | They propose a diverse expression retrieval task tailored to educational scenarios . they extract query style features as prototypes and build a continuously updated Prompt Bank . |
| Outcome: | The proposed model outperforms existing retrieval models in most retrieval tasks. |
Copied to clipboard
| Challenge: | Recent prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs). |
| Approach: | They propose a prompt tuning algorithm that uses a small-scale partial PLM and progressively expands its depth and width until the full-model size. |
| Outcome: | The proposed method could save over 30% of training computations while achieving comparable performance. |
Copied to clipboard
| Challenge: | Existing methods of natural language generation (NLG) rely on the extensive parameters of pretrained language models (PLMs) but their effectiveness may be compromised by insufficient domain-specific knowledge. |
| Approach: | They propose a knowledge-injected prompt encoder to incorporate domain knowledge during the training stage, thereby reducing computational overhead. |
| Outcome: | The proposed approach outperforms established baselines on real-world data in responsivity of claims and in the ability to transfer domain knowledge. |
Copied to clipboard
| Challenge: | Existing studies on prompt tuning have shown that language models can be effective few-shot learners with prompting. |
| Approach: | They propose to treat the hard prompt and soft prompt as separate inputs to mitigate noise brought by prompt initialization. |
| Outcome: | Experimental results show that the proposed method outperforms state-of-the-art methods by 6.97% in accuracy and reduces the standard deviation by 1.92 on average. |
Copied to clipboard
| Challenge: | Experimental results show that fine-tuning pretrained language models on helpful intermediate tasks yields further gains. |
| Approach: | They propose to train an affinity scoring function to predict transferability between tasks by conditioning on task embeddings. |
| Outcome: | The proposed method efficiently identifies beneficial tasks for transfer learning. |
Copied to clipboard
| Challenge: | Question-answering (QA) tasks investigate specific question types, knowledge domains, or reasoning skills, leading to specialized models catering to specific categories of QA tasks. |
| Approach: | They propose to use model and prompt tuning for unified QA in a low-resource setting to overcome drawbacks of unified models. |
| Outcome: | The proposed model and prompt tuning paradigms outperform model tuning in a few-shot setting with a good initialization and achieve a significant performance boost from pre-training in 'low-resource' setting. |
Copied to clipboard
| Challenge: | Recent advances in large language models have made it difficult to find appropriate prompts for tasks with multiple input-output formats. |
| Approach: | They propose a prompt tuning method based on reinforcement learning (RL) they propose an anchor model and an extension for generating input-dependent prompts. |
| Outcome: | The proposed method outperforms existing methods on a variety of tasks and achieves State-of-the-art performance across diverse types and sizes of LLMs. |
Copied to clipboard
| Challenge: | Pretrained language models are often finetuned for downstream tasks, which has been shown to improve performance over non-pretrained models. |
| Approach: | They propose a genetic algorithm to automatically search for the best prompt for few-shot learning with pretrained language models by gradient-free algorithm. |
| Outcome: | Experiments on diverse datasets show that the proposed method outperforms manual prompts by 2.6 points. |
Copied to clipboard
| Challenge: | Existing prompt tuning methods only introduce prompts at the input layer, limiting performance and leaving large room for improvement. |
| Approach: | They propose a method that involves tuning a small set of soft prompts for pre-trained language models. |
| Outcome: | The proposed method outperforms state-of-the-art methods with pre-trained models on the SuperGLUE benchmark. |
Copied to clipboard
| Challenge: | Prompt tuning for pre-trained language models has shown remarkable performance . however, prompt tuning is still not fully explored . |
| Approach: | They propose to pre-train prompts by adding soft prompts into the pre-training stage to obtain a better initialization. |
| Outcome: | The proposed framework outperforms full-model tuning under full-data and few-shot learning settings. |
Copied to clipboard
| Challenge: | Prompt tuning has been proven to be successful on various tasks by incorporating a small number of trainable parameters while freezing large pre-trained language models. |
| Approach: | They propose a token-wise prompt tuning method that uses a bank of finer-grained soft prompt tokens to generate an instance-dependent prompt. |
| Outcome: | The proposed method performs far better than full parameter fine-tuned models and achieves state-of-the-art by tuning only 0.035% parameters on 14 datasets. |
Copied to clipboard
| Challenge: | Poems are a distinct form of literature, with meanings that transcend beyond the literal words. |
| Approach: | They propose a framework to generate images that visually represent the meanings of poems using prompt tuning and a PoeKey algorithm to extract emotions, visual elements, and themes from poems. |
| Outcome: | The proposed framework generates images that visually represent the meanings of poems and their images. |
Copied to clipboard
| Challenge: | Pre-trained language models struggle on out-of-distribution compositional generalization . recent work shows considerable improvements on many NLP tasks from model scaling . |
| Approach: | They evaluate encoder-decoder models up to 11B parameters and decoder-only models up 540B parameters . they compare scaling curves for fine-tuning, prompt tuning, and in-context learning methods . |
| Outcome: | The proposed scaling methods improve compositional generalization on many tasks . fine-tuning generally has flat or negative scaling curves on out-of-distribution compositional . larger models are better at modeling the syntax of the output space, the study finds . |
Copied to clipboard
| Challenge: | Prompt tuning is a parameter-efficient approach to adapting pre-trained language models to downstream tasks. |
| Approach: | They propose to combine pre-trained modules with pre-trains to boost prompt tuning for few-shot learning. |
| Outcome: | The proposed model outperforms prompt tuning, full model tuning, and prior prompt pre-training methods in few-shot learning settings. |
Copied to clipboard
| Challenge: | generative multilingual models fine-tuned on English forget to generate non-English data when labeled data is only available in English . generative models fine tuned on English fail to generate multilingual summarization tasks when labeling data is available in other languages . |
| Approach: | They propose to use prompt tuning to overcome catastrophic forgetting in a generative task in . they assume a strict setting with no parallel data or machine translation . |
| Outcome: | The proposed method can overcome catastrophic forgetting to enable zero-shot cross-lingual generation. |
Copied to clipboard
| Challenge: | Foundation Models (FMs) have demonstrated success in a wide range of applications, but their optimization often requires access to sensitive data. |
| Approach: | They propose a framework that combines FMs and Federated Learning to enable privacy-preserving and collaborative learning across multiple end-users. |
| Outcome: | The proposed framework combines benefits of FMs and Federated Learning (FL) it enables privacy-preserving and collaborative learning across multiple end-users. |
Copied to clipboard
| Challenge: | Existing studies on diversity in large language models focus on the understudied class of fairness and inclusion concern in LLMs. |
| Approach: | They propose a technique to measure diversity in generated responses along people and culture axes by collective-critique and self-voting. |
| Outcome: | The proposed approach outperforms baseline methods and human evaluations with human and automated evaluations. |
Copied to clipboard
| Challenge: | Recent methods to recognize hierarchical discourse relations without explicit connectives are inefficient and ignore the utilization of the output probability distribution information of the verbalizer. |
| Approach: | They propose a global and local hierarchical prompt tuning framework which leverages top-up propagated probability as the global hierarchy to inject it into multi-level verbalizer. |
| Outcome: | The proposed framework achieves competitive results on two benchmacks. |
Copied to clipboard
| Challenge: | Prompt tuning is a method of pre-trained models that optimizes the prompt to adapt to downstream tasks. |
| Approach: | They propose a framework that learns to select the proper prompt layers by inserting a probabilistic gate at each intermediate layer. |
| Outcome: | The proposed framework can perform better than the state-of-the-art prompt tuning frameworks on ten benchmark datasets. |
Copied to clipboard
| Challenge: | Prompt tuning learns soft prompts to condition pre-trained Language Models for performing downstream tasks in a parameter-efficient manner. |
| Approach: | They propose a Prompt tuning model with an eXtremely small scale that learns soft prompts to condition the frozen Pre-trained Language Models for performing downstream tasks in a parameter-efficient manner. |
| Outcome: | The proposed model outperforms the vanilla Prompt-Tuning and can significantly improve across tasks and model scales. |
Copied to clipboard
| Challenge: | Recent advances on self-supervised learning have led to powerful vision-language pre-training models that achieve state-of-the-art performance on a wide range of cross-modal tasks. |
| Approach: | They propose a vision-language pre-training framework that reformulates discretized object positions and language in a unified language modeling framework. |
| Outcome: | The proposed model improves performance on position-sensitive vision-language (VL) tasks and also improves on position insensitive tasks. |
Copied to clipboard
| Challenge: | Pre-trained language models have demonstrated superior performance on various natural language processing tasks. |
| Approach: | They find that after prompt tuning, some neurons encode task-specific skills . they also show that skill neurons are most likely generated in pre-training . |
| Outcome: | The neurons are highly predictive of task labels after prompt tuning for specific tasks. |
Copied to clipboard
| Challenge: | Recent advances in fine-tuning Vision-Language Models have seen the success of prompt tuning and adapter tuning. |
| Approach: | They propose a method to fine-tune CLIP without introducing any overhead of extra parameters. |
| Outcome: | The proposed method improves CLIP by 7.27% average harmonic mean accuracy. |
Copied to clipboard
| Challenge: | Recent studies show that adding a instruction tuning stage to training large language models can improve zero-shot task generalization. |
| Approach: | They propose a method that retrieves promptspecific source prompt embeddings from training instances . they train soft prompt embeds for each prompt through prompt tuning and store the samples . |
| Outcome: | The proposed method outperforms hard prompts on unseen tasks by 2.39% points and outperformed 10 out of 11 datasets. |
Copied to clipboard
| Challenge: | Existing methods to select demonstration examples for in-context learning are based on token embeddings. |
| Approach: | They propose an algorithm to select demonstration examples for in-context learning of a query set . they use gradients of the output taken in the input embedding space to estimate model outputs . |
| Outcome: | The proposed algorithm outperforms existing methods based on token embeddings by 11% . it scales up subset selection that would otherwise run full inference by 37.7 on models with 34 billion parameters . |
Copied to clipboard
| Challenge: | Existing prompt tuning methods have training instability issues due to large variance of scores . existing prompt tuning algorithms have training stability issues due a slight change of input data . |
| Approach: | They propose an algorithm that smooths the loss landscape of vanilla prompt tuning by perturbation-based regularizers. |
| Outcome: | The proposed method improves the state-of-the-art prompt tuning methods by 1.94% and 2.34% on SuperGLUE and FewGLUE benchmarks. |
Copied to clipboard
| Challenge: | Prompt optimization is an important technique for adapting Large Language Models (LLMs) to specific tasks. |
| Approach: | They propose a zeroth-order approach which enables efficient prompt tuning solely via inference APIs. |
| Outcome: | The proposed approach outperforms existing black-box prompt tuning methods in terms of performance and convergence speed. |
Copied to clipboard
| Challenge: | Existing Large Vision-Language Models (LVLMs) lack integrated commonsense knowledge . lack of integrated common knowledge limits their robustness and accuracy in VQA . |
| Approach: | They propose a framework to enhance multimodal inference by integrating commonsense reasoning. |
| Outcome: | MAGIC-VQA improves comprehensive benchmark datasets, surpassing existing models in tasks requiring advanced commonsense reasoning. |
Copied to clipboard
| Challenge: | Prompt tuning is a technique that updates few parameters in pre-trained models for language understanding and generation tasks. |
| Approach: | They propose to leverage prompt tuning for neural text retrieval to improve generalization and cross-domain generalization. |
| Outcome: | The proposed approach can mitigate the two issues faced by fine-tuning retrieval methods and improve the out-of-domain zero-shot generalization of the retrieval models. |
Copied to clipboard
| Challenge: | Pre-trained language models inherit more human-like biases from the training corpora, causing computationally expensive problems. |
| Approach: | They propose parameter-efficient methods in combination with counterfactual data augmentation for bias mitigation. |
| Outcome: | The proposed methods are effective in mitigating gender bias, prompt tuning is more suitable for GPT-2 than BERT, and less effective when it comes to racial and religious bias. |
Copied to clipboard
| Challenge: | Prompt tuning has emerged as a successful parameter-efficient alternative to the full fine-tuning of language models. |
| Approach: | They propose a prompt tuning method that utilizes short soft prompts for efficient training and inference while maintaining performance gains typically induced by longer soft prompt. |
| Outcome: | The proposed method outperforms baseline methods while preserving memory usage. |
Copied to clipboard
| Challenge: | Pre-trained language models have achieved remarkable performance on various tasks. |
| Approach: | They propose a decomposed prompt tuning approach that utilizes low-rank matrices to initialize the soft prompt. |
| Outcome: | The proposed method significantly reduces the number of trainable parameters while maintaining effectiveness. |
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) is a technique that guides large language models to decompose complex tasks into multi-step reasoning processes. |
| Approach: | They propose a two-step reasoning framework based on prompt tuning to implement step-by-step thinking for MLMs on NLU tasks. |
| Outcome: | The proposed framework outperforms baselines and achieves state-of-the-art performance on two NLU tasks. |
Copied to clipboard
| Challenge: | Multilingual pre-trained language models (mPLMs) have demonstrated notable effectiveness in zero-shot cross-lingual transfer tasks. |
| Approach: | They propose a method that uses soft-prompt tuning to tune for language adaptation . prompt tuning outperforms continuously trained baselines on two benchmarks . |
| Outcome: | The proposed approach outperforms baselines on two text classification benchmarks while utilizing 0.28% of tuned parameters. |
Copied to clipboard
| Challenge: | Existing hierarchical text classification methods use prompt tuning or contrastive learning to implicitly learn label embeddings for classification, but this method fails to model hierarchy-aware geometric relations among labels. |
| Approach: | They propose a two-stage framework that transforms the label hierarchy from an implicit prior into an explicit embedding by using a general orthogonal frame. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods on three real-world HTC datasets. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown promising results for mining EHRs . translating time-stamped sequences into plain text can obscure both temporal structure and code identities, weakening the ability to capture code co-occurrence and longitudinal regularities. |
| Approach: | They propose a time-aware LLM framework that integrates structured EHR encoders through prompt tuning without modifying underlying architectures. |
| Outcome: | Experiments on MIMIC-III and MIMIC IV show that RePrompT outperforms both EHR-based and LLM-based baselines across multiple clinical prediction tasks. |
Copied to clipboard
| Challenge: | Prompt tuning has achieved remarkable progress in vision–language models, but its generalization ability in ALMs remains underexplored. |
| Approach: | They propose a plug-and-play framework that regularizes the prompt embedding space . they propose introducing a semantic expansion loss with margin constraints that promote compactness . |
| Outcome: | The proposed framework regularizes the prompt embedding space by incorporating semantic neighbors generated by large language models. |